Dynamically Varying Environments

نویسندگان

  • Anthony A. Maciejewski
  • Charles A. Klein
چکیده

The vast majority of work to date concerned with obstacle avoidance for manipulators has dealt with task descriptions in the form ofpick-and-place movements. The added flexibility in motion control for manipulators possessing redundant degrees offreedom permits the consideration of obstacle avoidance in the context of a specified end-effector trajectory as the task description. Such a task definition is a more accurate model for such tasks as spray painting or arc welding. The approach presented here is to determine the required joint angle rates for the manipulator under the constraints of multiple goals, the primary goal described by the specified end-effector trajectory and secondary goals describing the obstacle avoidance criteria. The decomposition of the solution into a particular and a homogeneous component effectively illustrates the priority of the multiple goals that is exact end-effector control with redundant degrees of freedom maximizing the distance to obstacles. An efficient numerical implementation of the technique permits sufficiently fast cycle times to deal with dynamic environments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dual-band, Dynamically Tunable Plasmonic Metamaterial Absorbers Based on Graphene for Terahertz Frequencies

In this paper, a compact plasmonic metamaterial absorber for terahertz frequencies is proposed and simulated. The absorber is based on metamaterial graphene structures, and benefits from dynamically controllable properties of graphene. Through patterning graphene layers, plasmonic resonances are tailored to provide a dual band as well as an improved bandwidth absorption. Unit cell of the design...

متن کامل

Hierarchical classification of dynamically varying radar pulse repetition interval modulation patterns

The central purpose of passive signal intercept receivers is to perform automatic categorization of unknown radar signals. Currently, there is an urgent need to develop intelligent classification algorithms for these devices due to emerging complexity of radar waveforms. Especially multifunction radars (MFRs) capable of performing several simultaneous tasks by utilizing complex, dynamically var...

متن کامل

Adaptable and extensible bindings in distributed environments

In distributed systems, there is a need for binding mechanisms that allow an application to be dynamically modified, extended or reconfigured to respond to varying requirements at execution time. Usual distributed platforms for application development do not allow such dynamic evolution. This paper presents a framework for adaptable and extensible bindings. We have built a binding model which i...

متن کامل

Adaptive Service in Mobile Computing Environments

Emerging communication-intensive applications require signiicant levels of networking resources for eecient operation. In the context of mobile computing environments, limited and dynamically varying available resources, stringent application requirements, and user mobility make it diicult to provide sustained quality of service to applications. This paper addresses the above issues, and propos...

متن کامل

Active Resource Management for Multi-Core Runtime Systems Serving Malleable Applications

Malleable applications are programs that may run with varying numbers of threads and thus on varying numbers of cores because the exact number of threads/cores used is irrelevant for the program logic and typically determined at program startup. We argue that any fixed choice of kernel threads is suboptimal for both performance and energy consumption. Firstly, an application may temporarily exp...

متن کامل

Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments

Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006